Designing Distributed Computational Skeletons in D-Clean and D-Box
نویسندگان
چکیده
Functional programming has inherent parallel features. This situation can be exploited by building different language constructs for parallel and distributed programming. Earlier we designed two languages for skeleton based distributed functional programming on a cluster. The two languages have different expressive power and abstraction levels. Our distributed functional computation is based on a multiparadigm-oriented environment with several different layers. On the highest level D-Clean coordination language primitives are applied in order to define the distribution of the pure functional computation subtasks over a PC cluster. This distribution is made according to a predefined computational scheme, which is an algorithmic skeleton, parameterized by functions, types and data. The D-Clean programs are transformed into D-Box, a lower level description language including the computational nodes implemented in the lazy functional language Clean. The computational nodes are distributed over the cluster and they communicate using the middleware services. This paper presents skeleton based functional and distributed programming using the D-Clean and D-Box languages. The main goal is to illustrate the appropriateness and applicability of the previously introduced languages for distributed evaluation of the functional programs on clusters. Here, therefore, we design distributed functional computational skeletons and we have provided a set of known algorithmic skeletons implemented as D-Clean schemes and a set of D-Box programs.
منابع مشابه
1 Coordination Language for Distributed Clean ∗
We present the high-level D-Clean language which supports the distributed computation of Clean functions. The distributed evaluation of functional programs, the communication between computational nodes needs high-level process description and coordination mechanism. We express computation of functions in the form of distributed process-networks. D-Clean contains language elements controlling t...
متن کاملComputational aspect to the nearest southeast submatrix that makes multiple a prescribed eigenvalue
Given four complex matrices $A$, $B$, $C$ and $D$ where $Ainmathbb{C}^{ntimes n}$ and $Dinmathbb{C}^{mtimes m}$ and let the matrix $left(begin{array}{cc} A & B C & D end{array} right)$ be a normal matrix and assume that $lambda$ is a given complex number that is not eigenvalue of matrix $A$. We present a method to calculate the distance norm (with respect to 2-norm) from $D$ to ...
متن کاملSemigroups with inverse skeletons and Zappa-Sz$acute{rm e}$p products
The aim of this paper is to study semigroups possessing $E$-regular elements, where an element $a$ of a semigroup $S$ is {em $E$-regular} if $a$ has an inverse $a^circ$ such that $aa^circ,a^circ a$ lie in $ Esubseteq E(S)$. Where $S$ possesses `enough' (in a precisely defined way) $E$-regular elements, analogues of Green's lemmas and even of Green's theorem hold, where Green's relations ${mathc...
متن کاملEvaluation of Factors Inf luencing Recovery of Herbicide 2,4-D from Drinking Water
Many modern analytical methods deal with the trace-level determination of compounds of interest in highly complex environmental samples by means of chromatographic techniques. The introduction of a “clean” sample into an analytical instrument can make analyses easier and prolongs the equipment life. The use of solid-phase extraction (SPE) has grown and is a fertile technique of sample prepa...
متن کاملExtremal Positive Solutions For The Distributed Order Fractional Hybrid Differential Equations
In this article, we prove the existence of extremal positive solution for the distributed order fractional hybrid differential equation$$int_{0}^{1}b(q)D^{q}[frac{x(t)}{f(t,x(t))}]dq=g(t,x(t)),$$using a fixed point theorem in the Banach algebras. This proof is given in two cases of the continuous and discontinuous function $g$, under the generalized Lipschitz and Caratheodory conditions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005